Polarizations and hook partitions
نویسندگان
چکیده
In this paper, we relate combinatorial conditions for polarizations of powers the graded maximal ideal with rank on submodules generated by collections Young tableaux. We apply discrete Morse theory to hypersimplex resolution introduced Batzies–Welker show that L-complex Buchsbaum and Eisenbud is supported a CW-complex. then translate “spanning tree condition” Almousa–Fløystad–Lohne characterizing into condition about which sets hook tableaux span certain Schur module. As an application, give complete characterization so-called “restricted powers” ideal.
منابع مشابه
Generalized Hook Lengths in Symbols and Partitions
In this paper we present, for any integer d, a description of the set of hooks in a d-symbol. We then introduce generalized hook length functions for a d-symbol, and prove a general result about them, involving the core and quotient of the symbol. We list some applications, for example to the well-known hook lengths in integer partitions. This leads in particular to a generalization of a relati...
متن کاملThe Borwein conjecture and partitions with prescribed hook differences
Peter Borwein has conjectured that certain polynomials have non-negative coefficients. In this paper we look at some generalizations of this conjecture and observe how they relate to the study of generating functions for partitions with prescribed hook differences. A combinatorial proof of the generating function for partitions with prescribed hook differences is given.
متن کاملSymmetry distribution between hook length and part length for partitions
— It is known that the two statistics on integer partitions “hook length” and “part length” are equidistributed over the set of all partitions of n. We extend this result by proving that the bivariate joint generating function by those two statistics is symmetric. Our method is based on a generating function by a triple statistic much easier to calculate.
متن کاملCombinatorial Proofs of Hook Generating Functions for Skew Plane Partitions
Sagan, B.E., Combinatorial proofs of hook generating functions for skew plane partitions, Theoretical Computer Science 117 (1993) 273-287. We provide combinatorial proofs of two hook generating functions for skew plane partitions. One proof involves the Hillman-Grass1 (1976) algorithm and the other uses a modification of Schiitzenberger’s (1963, 1977) “jeu de taquin” due to Kadell (to appear). ...
متن کاملCoincidences between Characters to Hook Partitions and 2-Part Partitions on Families arising from 2-Regular Classes
Strongly refining results by Regev, Regev and Zeilberger, we prove surprising coincidences between characters to 2-part partitions of size n and characters to hook partitions of size n+2 on two related families obtained by extending 2-regular conjugacy classes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2022
ISSN: ['1873-1376', '0022-4049']
DOI: https://doi.org/10.1016/j.jpaa.2022.107056